Fast decoders for topological quantum codes.
نویسندگان
چکیده
We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presence of defects. Such an algorithm is needed to preserve the quantum information stored in the ground space of a topologically ordered system and to decode topological error-correcting codes. For a system of linear size l, our algorithm runs in time logl compared to l{6} needed for the minimum-weight perfect matching algorithm previously used in this context and achieves a higher depolarizing error threshold.
منابع مشابه
Fast decoders for qudit topological codes
Qudit toric codes are a natural higher-dimensional generalization of the wellstudied qubit toric code. However, standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyse their error correction thresholds and efficiency. The first decoder is a gener...
متن کاملCellular-Automaton Decoders for Topological Quantum Memories
Decoders are one of the necessary building blocks for robust local quantum memories, basic primitives that must arguably be part of any functioning topological quantum computer. While surface codes have raised the prospects for scalability and performance of quantum storage devices, the task of decoding resorts to complicated classical algorithms. Such decoding algorithms are typically designed...
متن کاملPolar codes in a QKD Environment
Polar coding is the most recent encoding scheme in the quest for error correction codes that approaches the Shannon limit, has a simple structure, and admits fast decoders. As such, it is an interesting candidate for the quantum key distribution (QKD) protocol that normally operates at high bit error rates and requires codes that operate near the Shannon limit. This paper describes approaches t...
متن کاملFast Encoding and Decoding of Flexible-Rate and Flexible-Length Polar Codes
This work is on fast encoding and decoding of polar codes. We propose and detail 8-bit and 16-bit parallel decoders that can be used to reduce the decoding latency of the successive-cancellation decoder. These decoders are universal and can decode flexible-rate and flexible-length polar codes. We also present fast encoders that can be used to increase the throughput of serially-implemented pola...
متن کاملHypermap-Homology Quantum Codes (Ph.D. thesis)
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings of graphs, such as Kitaev’s toric code, have been discussed widely...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 104 5 شماره
صفحات -
تاریخ انتشار 2010